Nonrigid structure-from-motion: estimating shape and motion with hierarchical Priors

This paper describes methods for recovering time-varying shape and motion of non-rigid 3D objects from uncalibrated 2D point tracks. For example, given a video recording of a talking person, we would like to estimate the 3D shape of the face at each instant, and learn a model of facial deformation. Time-varying shape is modeled as a rigid transformation combined with a non-rigid deformation. Reconstruction is ill-posed if arbitrary deformations are allowed, and thus additional assumptions about deformations are required. We first suggest restricting shapes to lie within a low-dimensional subspace, and describe estimation algorithms. However, this restriction alone is insufficient to constrain reconstruction. To address these problems, we propose a reconstruction method using a Probabilistic Principal Components Analysis (PPCA) shape model, and an estimation algorithm that simultaneously estimates 3D shape and motion for each instant, learns the PPCA model parameters, and robustly fills-in missing data points. We then extend the model to model temporal dynamics in object shape, allowing the algorithm to robustly handle severe cases of missing data.     

A new approach to the cheap LQ regulator exploiting the geometric properties of the Hamiltonian system

The cheap LQ regulator is reinterpreted as an output nulling problem which is a basic problem of the geometric control theory. In fact, solving the LQ regulator problem is equivalent to keep the output of the related Hamiltonian system identically zero. The solution lies on a controlled invariant subspace whose dimension is characterized in terms of the minimal conditioned invariant of the original system, and the optimal feedback gain is computed as the friend matrix of the resolving subspace. This study yields a new computational framework for the cheap LQ regulator, relying only on the very basic and simple tools of the geometric approach, namely the algorithms for controlled and conditioned invariant subspaces and invariant zeros.     

Exploiting probability density function of deep convolutional autoencoders’ latent space for reliable COVID-19 detection on CT scans

The Journal of Supercomputing - We present a probabilistic method for classifying chest computed tomography (CT) scans into COVID-19 and non-COVID-19. To this end, we design and train, in an...     

Photonic-aware neural networks

Neural Computing and Applications - Photonics-based neural networks promise to outperform electronic counterparts, accelerating neural network computations while reducing power consumption and...     

Tunable electrochemistry of gold-silver alloy nanoshells

Nano Research - The widespread and increasing interest in enhancing biosensing technologies by increasing their sensitivities and lowering their costs has led to the exploration and application of...     

The Coriolis Interaction between the v2 = 1 and v3 = 2 States of Nitrosyl Bromide: Anomalous Quadrupole Patterns and Interstate Transitions in the Millimeter-Wave Spectrum

The millimeter-wave rotational spectra of 79BrNO and 81BrNO in the v2 = 1 and v3 = 2 vibrational states have been reinvestigated. Measurements of the rotational spectrum in the region of maximum c-type Coriolis interaction between the two states allowed the previous analysis to be extended to account for some uncommon effects. For the most perturbed transitions the nuclear quadrupole hyperfine structure arises from coupling of not only the bromine nucleus, but also the nitrogen nucleus with the rotational angular momentum. These effects were satisfactorily fitted with a Hamiltonian describing Coriolis coupling in a molecule with two quadrupolar nuclei. The successful analysis of pure rotational transitions then allowed accurate prediction of rovibrational transitions, six of which were measured for 79BrNO and four for 81BrNO. Copyright 1998 Academic Press.     

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.     

Oris: a tool for modeling, verification and evaluation of real-time systems

Oris is a tool for qualitative verification and quantitative evaluation of reactive timed systems, which supports modeling and analysis of various classes of timed extensions of Petri Nets. As most characterizing features, Oris implements symbolic state space analysis of preemptive Time Petri Nets, which enable schedulability analysis of real-time systems running under priority preemptive scheduling; and stochastic Time Petri Nets, which enable an integrated approach to qualitative verification and quantitative evaluation. In this paper, we present the current version of the tool and we illustrate its application to two different case studies in the areas of qualitative verification and quantitative evaluation, respectively.